Delay analysis of a probabilistic priority discipline
نویسندگان
چکیده
منابع مشابه
Communication Networks Delay Analysis of a Probabilistic Priority Discipline
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diverse performance requirements. With this discipline, however, packets at higher priority levels can starve packets at lower priority levels. To resolve this starvation problem, we propose to assign a parameter to each p...
متن کاملA Probabilistic Priority Scheduling Discipline for High Speed Networks
In high speed networks, the Strict Priority (SP) scheduling discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diverse performance requirements. With this discipline, however, packets at higher priority levels can starve packets at lower priority levels. To resolve this starvation problem, we propose to assign a parame...
متن کاملA Probabilistic Priority Scheduling Discipline for Multi-Service Networks
This paper proposes a novel scheduling discipline for service differentiation in multi-service networks, which is referred to as the Probabilistic Priority (PP) discipline. PP is based on the Strict Priority (SP) discipline with the difference that each priority class is assigned a parameter. The parameter determines the probability with which its corresponding queue is served when it is polled...
متن کاملDelay Analysis of a HOL Priority Queue
Priority scheduling for packets is a hot topic, as interactive (voice,video) services are being integrated in existing data networks. In this paper, we consider a discrete-time queueing system with a non-preemptive (or Head-Of-the-Line) priority scheduling discipline and a general number of priority classes. Packets of variable length arrive in the queueing system. We derive expressions for the...
متن کاملA Packet Switch with a Priority Scheduling Discipline: Performance Analysis
In this paper, we analyze a discrete-time GI-G1, Geo2-1 preemptive resume priority queue. We consider two classes of packets which have to be served, where one class has preemptive resume priority over the other. The high-priority class contains packets with generally distributed service times while the low-priority packets are assumed to have geometrically distributed service times. We show th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Transactions on Telecommunications
سال: 2002
ISSN: 1124-318X,1541-8251
DOI: 10.1002/ett.4460130603